Finding lasting dense subgraphs
نویسندگان
چکیده
منابع مشابه
Best Friends Forever (BFF): Finding Lasting Dense Subgraphs
Graphs form a natural model for relationships and interactions between entities, for example, between people in social and cooperation networks, servers in computer networks, or tags and words in documents and tweets. But, which of these relationships or interactions are the most lasting ones? In this paper, given a set of graph snapshots, which may correspond to the state of a dynamic graph at...
متن کاملFinding Dense Subgraphs
In this paper we establish that the Lovász θ function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM−θ graphs, on which Lovász θ function can be approximated well by a Support vector machine (SVM). We show that Erdös-Rényi random G(n, p) graphs are SVM−θ graphs for log4 n n ≤ p< 1. Even if we embed a large clique of size Θ (√ np 1−p ) in a G(n, p) graph ...
متن کاملOn Finding Dense Subgraphs
Given an undirected graph G = (V,E), the density of a subgraph on vertex set S is defined as d(S) = |E(S)| |S| , where E(S) is the set of edges in the subgraph induced by nodes in S. Finding subgraphs of maximum density is a very well studied problem. One can also generalize this notion to directed graphs. For a directed graph one notion of density given by Kannan and Vinay is as follows: given...
متن کاملFinding Connected Dense k -Subgraphs
Given a connected graph G on n vertices and a positive integer k ≤ n, a subgraph of G on k vertices is called a k-subgraph in G. We design combinatorial approximation algorithms for finding a connected ksubgraph in G such that its density is at least a factor Ω(max{n, k/n}) of the density of the densest k-subgraph in G (which is not necessarily connected). These particularly provide the first n...
متن کاملA Finding dynamic dense subgraphs
Online social networks are often defined by considering interactions of entities at an aggregate level. For example, a call graph is formed among individuals who have called each other at least once; or at least k times. Similarly, in social-media platforms we consider implicit social networks among users who have interacted in some way, e.g., have made a conversation, have commented to the con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Mining and Knowledge Discovery
سال: 2018
ISSN: 1384-5810,1573-756X
DOI: 10.1007/s10618-018-0602-x